面向多目标跟踪的PHD滤波多传感器数据融合算法

针对密集杂波环境下单传感器应用高斯混合PHD算法进行多目标跟踪时性能下降的问题,提出一种面向多目标跟踪的PHD滤波多传感器数据融合算法。首先构建了基于高斯混合PHD滤波的多传感器数据融合系统框架,各传感器利用高斯混合PHD滤波算法进行局部状态估计,然后对各传感器的状态估计结果进行关联度计算,最后通过构建自适应混合参数,引入协方差交叉算法对关联状态进行融合。仿真实验表明,与单传感器高斯混合PHD多目标跟踪算法相比,所提算法有效提高了目标数量和状态的估计精度。     

Does military expenditure increase external debt? Evidence from Asia

This article empirically explores the effect of military spending on external debt, using a sample of ten Asian countries over the years from 1990 to 2011. The Hausman’s test suggests that the random-effects model is preferable; however, both random-effects and fixed-effects models are used in this research. The empirical results show that the effect of military spending on external debt is positive, while the effects of foreign exchange reserves and of economic growth on external debt are negative. For developing countries caught in security dilemma, military expenditure often requires an increase in external debt, which may affect economic development negatively.     

图像标注研究及其在情报处理中的应用

图像数据具有直观、信息量丰富等特点。图像标注方法通过获取图像特征,训练语言模型,实现用自然语言自动描述图像信息。简要介绍了图像标注方法的分类及其相关关键技术。研究表明,通过对大规模图像的自动描述,能更好地管理、分析海量图像信息,能高效地对图像进行分类、检索。结合特定的信息处理技术,图像标注可用于发现有价值的情报信息,为国防安全、战略决策等提供信息支撑。     

美国陆军数据战略目标及实施

为深入研究美陆军数据战略目标及实施策略,为我军数据战略研究提供借鉴,文章对美陆军2016年发布的最新《陆军数据战略》进行分析,指出其目标是实现数据的可视化、可获取、可信任、可理解和互操作,并对美陆军数据战略的具体实施策略进行了剖析,指出美国陆军数据战略推动的是美军军事作战理论转型,从"网络为中心"转变为以"数据为中心"作战理念,其核心意图在于以数据优势实现指挥决策优势。     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

地籍数据库点线拓扑一致性并行检查方法

针对拓扑检查算法复杂、计算量大,串行计算已远不能满足海量地籍数据高效拓扑检查需求的问题,在分析了点线拓扑关系的并行特点基础上,将界址点的数据划分方法与界址线的QR空间索引方法相结合,实现了界址点与界址线的并行拓扑计算。用某地区实际的界址点集与界址线集对点线拓扑并行检查进行实验。测试结果表明:并行检查算法的并行效率随着进程数的增加而有所衰减,但稳定在30%以上,加速比达到5以上,且相比于Arc GIS效率提升了30倍以上。并行检查方法以工具的方式集成应用于高性能地理计算平台中,应用效果良好。     

A learning tabu search for a truck allocation problem with linear and nonlinear cost components

The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015     

基于载波相位辅助的GNSS天线阵抗干扰算法*

对于全球卫星导航定位系统,干扰和多径是影响接收机导航定位性能的两个主要因素。针对卫星导航接收机的抗干扰问题,提出了一种基于载波相位辅助的卫星导航天线阵抗干扰算法。该算法进行盲零陷形成的同时利用各阵元通道输出信号的载波相位辅助来进行盲波束形成,并通过控制算法实现智能切换。仿真结果表明,提出的算法在干扰环境且接收机冷启动的条件下仍能成功抑制干扰、正常工作,在无干扰或弱干扰条件下能进行波束形成来增强卫星信号,从而提高卫星可见性以及定位精度。提出的算法不需要阵列校正以及姿态测量单元辅助,其实现代价远小于传统的波束形成算法。